Time Analysis of the State Space of Real-time Preemptive Systems
نویسنده
چکیده
We present in this paper an algorithm making it possible an efficient time analysis of the state space of preemptive real time systems modeled using Time Petri Nets with inhibitor arcs. For this effect, we discuss how to determine from the reachability graph linear and quantitative properties of the remote model. Then, we propose an algorithm to compute an approximation of the minimal and the maximal time distances of any firing sequence. Contrarily to other techniques, our algorithm enjoys a linear complexity time cost and can be performed on the fly when building the reachability graph without requiring to extend the original model with observers.
منابع مشابه
A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملAdmissibility analysis for discrete-time singular systems with time-varying delays by adopting the state-space Takagi-Sugeno fuzzy model
This paper is pertained with the problem of admissibility analysis of uncertain discrete-time nonlinear singular systems by adopting the state-space Takagi-Sugeno fuzzy model with time-delays and norm-bounded parameter uncertainties. Lyapunov Krasovskii functionals are constructed to obtain delay-dependent stability condition in terms of linear matrix inequalities, which is dependent on the low...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملSafety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملAnalysis of Power Electronic Converters Using the Developed State Space Averaging Method
Power electronic converters are non-linear time-dependent systems whose exact analysis without the use of computers is very difficult, and even using computer softwares requires a long time. Use of the state space averaging method, as will be mentioned, in addition to simplifying the analysis procedure which is a result of converting a time-dependent system to a time-independent one, reduces th...
متن کاملAnalysis of Power Electronic Converters Using the Developed State Space Averaging Method
Power electronic converters are non-linear time-dependent systems whose exact analysis without the use of computers is very difficult, and even using computer softwares requires a long time. Use of the state space averaging method, as will be mentioned, in addition to simplifying the analysis procedure which is a result of converting a time-dependent system to a time-independent one, reduces th...
متن کامل